منابع مشابه
Isometric embeddings in Hamming graphs
The results presented in this paper are parts of my doctoral thesis [ 193; the algorithm and some of the characterizations in Section 7 have been introduced in [ 181. Motivation for isometric embeddings into Hamming graphs has come from communication theory (Graham and Pollak [ 121) an-d linguistics (Firsov 1181). Isometric subgraphs of Hamming graphs also appear in biology as “quasi-species” (...
متن کاملOn Isometric Embeddings of Graphs
If G is a finite connected graph with vertex set V and edge set E, a standard way of defining a distance da on G is to define dG(x, y) to be the number of edges in a shortest path joining x and y in V. If (M, dM) is an arbitrary metric space, then an embedding X: V-> M is said to be isometric if dG(x, y) = dM(\(x), X(y)) for all x, y e V. In this paper we will lay the foundation for a theory of...
متن کاملSubdivided graphs as isometric subgraphs of Hamming graphs
Résumé It is proven that given G a subdivision of a clique Kn (n ≥ 1), G is isometrically embeddable in a Hamming graph if and only if G is a partial cube or G = Kn. The characterization for subdivided wheels is also obtained.
متن کاملIsometric embeddings of Johnson graphs in Grassmann graphs
Let V be an n-dimensional vector space (4 ≤ n < ∞) and let Gk(V ) be the Grassmannian formed by all k-dimensional subspaces of V . The corresponding Grassmann graph will be denoted by Γk(V ). We describe all isometric embeddings of Johnson graphs J (l,m), 1 < m < l − 1 in Γk(V ), 1 < k < n − 1 (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of J (n, k...
متن کاملApplications of isometric embeddings to chemical graphs
Abstract. Applications of isometric embeddings of benzenoid graphs are surveyed. Their embeddings into hypercubes provide methods for computing the Wiener index and the Szeged index, while embeddings into the Cartesian product of trees lead to fast algorithms. A new method for computing the hyperWiener index of partial cubes in general, and of benzenoid graphs and trees in particular, is also p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1990
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90073-9